Sufficient conditions for admissibility
نویسنده
چکیده
Sufficient conditions for the finite and infinite-time admissibility of an observation operator are given. It is shown that the estimates of Weiss are close to being sufficient. If the semigroup is surjective, then the estimate is sufficient.
منابع مشابه
Admissibility in a One Parameter Non-regular Family with Squared-log Error Loss Function
‎Consider an estimation problem in a one-parameter non-regular distribution when both endpoints of the support depend on a single parameter‎. ‎In this paper‎, ‎we give sufficient conditions for a generalized Bayes estimator of a parametric function to be admissible‎. ‎Some examples are given‎. ‎
متن کاملA necessary condition for a Shearlet system to be a frame via admissibility
Necessary conditions for shearlet and cone-adapted shearlet systems to be frames are presented with respect to the admissibility condition of generators.
متن کاملSupport Measure Admissibility Based on Operations on Instance Graphs
The concept of support is central to data mining. While the definition of support in transaction databases is intuitive and simple, that is not the case in graph datasets and databases. Most mining algorithms require the support of a pattern to be no grater than that of its subpatterns, a property called anti-monotonicity or admissibility. This study examines the requirements for admissibility ...
متن کاملAdmissibility and minimaxity of generalized Bayes estimators for spherically symmetric family
Abstract: We give a sufficient condition for admissibility of generalized Bayes estimators of the location vector of spherically symmetric distribution under squared error loss. Compared to the known results for the multivariate normal case, our sufficient condition is very tight and is close to being a necessary condition. In particular we establish the admissibility of generalized Bayes estim...
متن کاملSpace Distortion and Monotone Admissibility in Agglomerative Clustering
This paper discusses the admissibility of agglomerative hierarchical clustering algorithms with respect to space distortion and monotonicity, as defined by Yadohisa et al. and Batagelj, respectively. Several admissibilities and their properties are given for selecting a clustering algorithm. Necessary and sufficient conditions for an updating formula, as introduced by Lance and Williams, are pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Systems & Control Letters
دوره 54 شماره
صفحات -
تاریخ انتشار 2005